0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.34	% Computer   : n014.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Jul 13 12:15:04 EDT 2021
0.13/0.34	% CPUTime    : 
0.20/0.34	% Number of cores: 8
0.20/0.34	% Python version: Python 3.6.8
0.20/0.34	# Version: 2.6rc1-ho
0.20/0.35	# No SInE strategy applied
0.20/0.35	# Trying AutoSched0 for 59 seconds
0.20/0.53	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.20/0.53	# and selection function SelectComplexExceptUniqMaxHorn.
0.20/0.53	#
0.20/0.53	# Preprocessing time       : 0.030 s
0.20/0.53	# Presaturation interreduction done
0.20/0.53	
0.20/0.53	# Proof found!
0.20/0.53	# SZS status Theorem
0.20/0.53	# SZS output start CNFRefutation
0.20/0.53	thf(multiplication_def, axiom, ![X11:$i > $o, X3:$i > $o]:(multiplication @ (sup @ X11) @ (sup @ X3))=(sup @ (crossmult @ X11 @ X3)), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', multiplication_def)).
0.20/0.53	thf(crossmult_def, axiom, (crossmult)=(^[X7:$i > $o, X3:$i > $o, X8:$i]:?[X9:$i, X10:$i]:((X7 @ X9&X3 @ X10)&(X8)=(multiplication @ X9 @ X10))), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', crossmult_def)).
0.20/0.53	thf(sup_es, axiom, (sup @ emptyset)=(zero), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', sup_es)).
0.20/0.53	thf(emptyset_def, axiom, (emptyset)=(^[X1:$i]:~$true), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', emptyset_def)).
0.20/0.53	thf(sup_singleset, axiom, ![X1:$i]:(sup @ (singleton @ X1))=(X1), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', sup_singleset)).
0.20/0.53	thf(singleton_def, axiom, (singleton)=(^[X1:$i, X4:$i]:(X4)=(X1)), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', singleton_def)).
0.20/0.53	thf(multiplication_anni, conjecture, ![X9:$i]:(multiplication @ X9 @ zero)=(zero), file('/export/starexec/sandbox/benchmark/theBenchmark.p', multiplication_anni)).
0.20/0.53	thf(c_0_7, plain, ![X29:$i, X3:$i > $o, X11:$i > $o]:(epred3_3 @ X11 @ X3 @ X29<=>?[X30:$i, X31:$i]:((X11 @ X30&X3 @ X31)&(X29)=(multiplication @ X30 @ X31))), introduced(definition)).
0.20/0.53	thf(c_0_8, plain, ![X1:$i]:~epred4_1 @ X1, inference(fof_simplification,[status(thm)],[introduced(definition)])).
0.20/0.53	thf(c_0_9, plain, ![X11:$i > $o, X3:$i > $o]:(multiplication @ (sup @ X11) @ (sup @ X3))=(sup @ (epred3_3 @ X11 @ X3)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[multiplication_def, crossmult_def]), c_0_7])).
0.20/0.53	thf(c_0_10, plain, (sup @ epred4_1)=(zero), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[sup_es, emptyset_def]), c_0_8])).
0.20/0.53	thf(c_0_11, plain, ![X42:$i > $o, X43:$i > $o]:(multiplication @ (sup @ X42) @ (sup @ X43))=(sup @ (epred3_3 @ X42 @ X43)), inference(variable_rename,[status(thm)],[c_0_9])).
0.20/0.53	thf(c_0_12, plain, (sup @ epred4_1)=(zero), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.53	thf(c_0_13, plain, ![X2:$i > $o, X3:$i > $o]:(multiplication @ (sup @ X2) @ (sup @ X3))=(sup @ (epred3_3 @ X2 @ X3)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.53	thf(c_0_14, plain, ![X63:$i]:~epred4_1 @ X63, inference(variable_rename,[status(thm)],[c_0_8])).
0.20/0.53	thf(c_0_15, plain, ![X53:$i, X54:$i > $o, X55:$i > $o, X58:$i, X59:$i > $o, X60:$i > $o, X61:$i, X62:$i]:((((X55 @ (esk2_3 @ X53 @ X54 @ X55)|~epred3_3 @ X55 @ X54 @ X53)&(X54 @ (esk3_3 @ X53 @ X54 @ X55)|~epred3_3 @ X55 @ X54 @ X53))&((X53)=(multiplication @ (esk2_3 @ X53 @ X54 @ X55) @ (esk3_3 @ X53 @ X54 @ X55))|~epred3_3 @ X55 @ X54 @ X53))&(~X60 @ X61|~X59 @ X62|(X58)!=(multiplication @ X61 @ X62)|epred3_3 @ X60 @ X59 @ X58)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])])).
0.20/0.53	thf(c_0_16, plain, ![X2:$i > $o, X3:$i > $o]:((multiplication @ (sup @ X2) @ (sup @ X3))=(zero)|(epred3_3 @ X2 @ X3)!=(epred4_1)), inference(ext_sup,[status(thm)],[c_0_12, c_0_13])).
0.20/0.53	thf(c_0_17, plain, ![X28:$i, X1:$i]:(epred2_2 @ X1 @ X28<=>(X28)=(X1)), introduced(definition)).
0.20/0.53	thf(c_0_18, plain, ![X1:$i]:~epred4_1 @ X1, inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.53	thf(c_0_19, plain, ![X3:$i > $o, X2:$i > $o, X1:$i]:(X2 @ (esk3_3 @ X1 @ X2 @ X3)|~epred3_3 @ X3 @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_15])).
0.20/0.53	thf(c_0_20, plain, ![X2:$i > $o, X3:$i > $o]:((multiplication @ (sup @ X2) @ (sup @ X3))=(zero)|(epred3_3 @ X2 @ X3 @ (esk23_2 @ X2 @ X3))!=(epred4_1 @ (esk23_2 @ X2 @ X3))), inference(neg_ext,[status(thm)],[c_0_16])).
0.20/0.53	thf(c_0_21, plain, ![X1:$i]:(sup @ (epred2_2 @ X1))=(X1), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[sup_singleset, singleton_def]), c_0_17])).
0.20/0.53	thf(c_0_22, negated_conjecture, ~(![X9:$i]:(multiplication @ X9 @ zero)=(zero)), inference(assume_negation,[status(cth)],[multiplication_anni])).
0.20/0.53	thf(c_0_23, plain, ![X2:$i > $o, X1:$i]:~epred3_3 @ X2 @ epred4_1 @ X1, inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.20/0.53	thf(c_0_24, plain, ![X2:$i > $o, X3:$i > $o]:((multiplication @ (sup @ X2) @ (sup @ X3))=(zero)|epred3_3 @ X2 @ X3 @ (esk23_2 @ X2 @ X3)), inference(sr,[status(thm)],[inference(dynamic cnf,[status(thm)],[c_0_20]), c_0_18])).
0.20/0.53	thf(c_0_25, plain, ![X41:$i]:(sup @ (epred2_2 @ X41))=(X41), inference(variable_rename,[status(thm)],[c_0_21])).
0.20/0.53	thf(c_0_26, negated_conjecture, (multiplication @ esk1_0 @ zero)!=(zero), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])).
0.20/0.53	thf(c_0_27, plain, ![X2:$i > $o]:(multiplication @ (sup @ X2) @ zero)=(zero), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_12])).
0.20/0.53	thf(c_0_28, plain, ![X1:$i]:(sup @ (epred2_2 @ X1))=(X1), inference(split_conjunct,[status(thm)],[c_0_25])).
0.20/0.53	thf(c_0_29, negated_conjecture, (multiplication @ esk1_0 @ zero)!=(zero), inference(split_conjunct,[status(thm)],[c_0_26])).
0.20/0.53	thf(c_0_30, plain, ![X1:$i]:(multiplication @ X1 @ zero)=(zero), inference(spm,[status(thm)],[c_0_27, c_0_28])).
0.20/0.53	thf(c_0_31, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_30])]), ['proof']).
0.20/0.53	# SZS output end CNFRefutation
0.20/0.53	# Proof object total steps             : 32
0.20/0.53	# Proof object clause steps            : 13
0.20/0.53	# Proof object formula steps           : 19
0.20/0.53	# Proof object conjectures             : 5
0.20/0.53	# Proof object clause conjectures      : 2
0.20/0.53	# Proof object formula conjectures     : 3
0.20/0.53	# Proof object initial clauses used    : 6
0.20/0.53	# Proof object initial formulas used   : 7
0.20/0.53	# Proof object generating inferences   : 3
0.20/0.53	# Proof object simplifying inferences  : 4
0.20/0.53	# Training examples: 0 positive, 0 negative
0.20/0.53	# Parsed axioms                        : 27
0.20/0.53	# Removed by relevancy pruning/SinE    : 0
0.20/0.53	# Initial clauses                      : 38
0.20/0.53	# Removed in clause preprocessing      : 12
0.20/0.53	# Initial clauses in saturation        : 26
0.20/0.53	# Processed clauses                    : 1353
0.20/0.53	# ...of these trivial                  : 5
0.20/0.53	# ...subsumed                          : 799
0.20/0.53	# ...remaining for further processing  : 549
0.20/0.53	# Other redundant clauses eliminated   : 2849
0.20/0.53	# Clauses deleted for lack of memory   : 0
0.20/0.53	# Backward-subsumed                    : 9
0.20/0.53	# Backward-rewritten                   : 27
0.20/0.53	# Generated clauses                    : 10325
0.20/0.53	# ...of the previous two non-trivial   : 6981
0.20/0.53	# Contextual simplify-reflections      : 0
0.20/0.53	# Paramodulations                      : 1476
0.20/0.53	# Factorizations                       : 4
0.20/0.53	# NegExts                              : 492
0.20/0.53	# Equation resolutions                 : 2849
0.20/0.53	# Propositional unsat checks           : 0
0.20/0.53	#    Propositional check models        : 0
0.20/0.53	#    Propositional check unsatisfiable : 0
0.20/0.53	#    Propositional clauses             : 0
0.20/0.53	#    Propositional clauses after purity: 0
0.20/0.53	#    Propositional unsat core size     : 0
0.20/0.53	#    Propositional preprocessing time  : 0.000
0.20/0.53	#    Propositional encoding time       : 0.000
0.20/0.53	#    Propositional solver time         : 0.000
0.20/0.53	#    Success case prop preproc time    : 0.000
0.20/0.53	#    Success case prop encoding time   : 0.000
0.20/0.53	#    Success case prop solver time     : 0.000
0.20/0.53	# Current number of processed clauses  : 454
0.20/0.53	#    Positive orientable unit clauses  : 11
0.20/0.53	#    Positive unorientable unit clauses: 0
0.20/0.53	#    Negative unit clauses             : 125
0.20/0.53	#    Non-unit-clauses                  : 318
0.20/0.53	# Current number of unprocessed clauses: 5671
0.20/0.53	# ...number of literals in the above   : 26830
0.20/0.53	# Current number of archived formulas  : 0
0.20/0.53	# Current number of archived clauses   : 90
0.20/0.53	# Clause-clause subsumption calls (NU) : 18964
0.20/0.53	# Rec. Clause-clause subsumption calls : 9379
0.20/0.53	# Non-unit clause-clause subsumptions  : 425
0.20/0.53	# Unit Clause-clause subsumption calls : 2580
0.20/0.53	# Rewrite failures with RHS unbound    : 0
0.20/0.53	# BW rewrite match attempts            : 11
0.20/0.53	# BW rewrite match successes           : 7
0.20/0.53	# Condensation attempts                : 0
0.20/0.53	# Condensation successes               : 0
0.20/0.53	# Termbank termtop insertions          : 108050
0.20/0.53	
0.20/0.53	# -------------------------------------------------
0.20/0.53	# User time                : 0.172 s
0.20/0.53	# System time              : 0.014 s
0.20/0.53	# Total time               : 0.187 s
0.20/0.53	# Maximum resident set size: 1680 pages
0.20/0.53	EOF